#include<bits/stdc++.h>
using namespace std;

deque<int> q;
int n,r,ans;

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>r;
        q.push_back(r);
    }
    sort(q.begin(),q.end());
    r=1;
    while(r<q.size()){
        if(q[r]>q[0])q.pop_front();
        else r++;
    }
    cout<<q.size()<<endl;
    return 0;
}
